Optimal Nearly-Similar Polygon Stabbers of Convex Polygons
نویسندگان
چکیده
A convex polygon that is nearly-similar to a model polygon P has sides parallel and in the same order to the corresponding sides of P. The lengths of the sides are unrestricted and may be zero. Given a set of target convex polygons in the plane with a total of n vertices, and a xed model convex stabbing polygon P, the minimum-perimeter polygon nearly-similar to P that stabs the targets can be found in time O(n) (but time exponential in the number of sides in the stabbing polygon).
منابع مشابه
Optimal Algorithms for Stabbing Polygons by Monotone Chains
In this paper we present optimal algorithms to compute monotone stabbers for convex polygons. More precisely, given a set of m convex polygons with n vertices in total we want to stab the polygons with an x-monotone polygonal chain such that each polygon is entered at its leftmost point and departed at its rightmost point. Since such a stabber does not exist in general, we study two related pro...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملAn Optimal Algorithm for the Separating Common Tangents of Two Polygons
We describe an algorithm for computing the separating common tangents of two simple polygons using linear time and only constant workspace. A tangent of a polygon is a line touching the polygon such that all of the polygon lies to the same side of the line. A separating common tangent of two polygons is a tangent of both polygons where the polygons are lying on different sides of the tangent. E...
متن کاملSequentially Divisible Dissections of Simple Polygons
A k-dissection D of a polygon P , is a partition of P into a set of subpolygons {Q1, . . . ,Qm} with disjoint interiors such that these can be reassembled to form k polygons P1, . . . ,Pk all similar to P . D is called non-trivial if none of {Q1, . . . ,Qm} is similar to P . In this paper we show that any convex n-gon has a k-dissection (resp. sequential dissection) with (k − 1)n + 1 pieces, n ...
متن کاملScandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box
We show how to compute the smallest rectangle that can enclose any polygon, from a given set of polygons, in nearly linear time; we also present a PTAS for the problem, as well as a linear-time algorithm for the case when the polygons are rectangles themselves. We prove that finding a smallest convex polygon that encloses any of the given polygons is NP-hard, and give a PTAS for minimizing the ...
متن کامل